Fast Decision Procedure for Propositional Dummett Logic Based on a Multiple Premise Tableau Calculus
نویسنده
چکیده
We present a procedure to decide propositional Dummett logic. This procedure relies on a tableau calculus with a multiple premise rule and optimizations. The resulting implementation outperforms the state of the art graph-based procedure.
منابع مشابه
A Tableau Calculus for Dummett Logic Based on Increasing the Formulas Equivalent to the True and the Replacement Rule
In this paper we present a multiple premise tableau calculus for propositional Dummett Logic. The aim is to improve the efficiency of the known decision procedures. The investigation is related to the possibility of reducing the size of the deduction by the replacement rule and rules that introduce formulas equivalent to the logical constant True. In this way we want to bound the application of...
متن کاملTableau Calculus for Dummett Logic Based on Present and Next State of Knowledge
In this paper we use the Kripke semantics characterization of Dummett logic to introduce a new way of handling non-forced formulas in tableau proof systems. We pursue the aim of reducing the search space by strictly increasing the number of forced propositional variables after the application of non-invertible rules. The focus of the paper is on a new tableau system for Dummett logic, for which...
متن کاملA Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic
Propositional interval temporal logics are quite expressive temporal logics that allow one to naturally express statements that refer to time intervals. Unfortunately, most such logics turned out to be (highly) undecidable. To get decidability, severe syntactic and/or semantic restrictions have been imposed to interval-based temporal logics that make it possible to reduce them to point-based on...
متن کاملRefutation in Dummett Logic Using a Sign to Express the Truth at the Next Possible World
In this paper we use the Kripke semantics characterization of Dummett logic to introduce a new way of handling non-forced formulas in tableau proof systems. We pursue the aim of reducing the search space by strictly increasing the number of forced propositional variables after the application of noninvertible rules. The focus of the paper is on a new tableau system for Dummett logic, for which ...
متن کاملOn Constructing Fibred Tableaux for BDI Logics
In [11,13] we showed how to combine propositional BDI logics using Gabbay’s fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based decision procedure for the combined/fibred logics. We show how to uniformly construct a tableau calculus for the combined logic using Governatori’s labelled tableau system KEM.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 180 شماره
صفحات -
تاریخ انتشار 2010